class Solution
{
public:
    bool findSubarrays(vector<int> &nums)
    {
        unordered_set<int> s;
        int n = nums.size();
        for (int i = 0; i < n - 1; ++i)
        {
            int twoSum = nums[i] + nums[i + 1];
            if (s.count(twoSum))
            {
                return true;
            }
            s.insert(twoSum);
        }
        return false;
    }
};